Semi-equilibrium models for paracoherent answer set programs

نویسندگان

  • Giovanni Amendola
  • Thomas Eiter
  • Michael Fink
  • Nicola Leone
  • João Moura
چکیده

Article history: Received 22 December 2014 Received in revised form 14 October 2015 Accepted 21 January 2016 Available online 4 February 2016

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Computation of Paracoherent Answer Sets

Answer Set Programming (ASP) is a well-established formalism for nonmonotonic reasoning. An ASP program can have no answer set due to cyclic default negation. In this case, it is not possible to draw any conclusion, even if this is not intended. Recently, several paracoherent semantics have been proposed that address this issue, and several potential applications for these semantics have been i...

متن کامل

Dealing with Incoherence in ASP: Split Semi-Equilibrium Semantics

The answer set semantics may assign a logic program no model due to classic contradiction or cyclic negation. The latter can be remedied by a paracoherent semantics given by semi-equilibrium (SEQ) models, which are 3-valued interpretations that generalize the logical reconstruction of answer sets given by equilibrium models. However SEQ-models miss modularity in the rules, such that a natural m...

متن کامل

Paracoherent Answer Set Programming

We study the problem of reasoning from incoherent answer set programs, i.e., from logic programs that do not have an answer set due to cyclic dependencies of an atom from its default negation. As a starting point we consider so-called semi-stable models which have been developed for this purpose building on a program transformation, called epistemic transformation. We give a model-theoretic cha...

متن کامل

Synonymus Theories in Answer Set Programming and Equilibrium Logic

The study of strong equivalence between logic programs or nonmonotonic theories under answer set semantics, begun in [18], is extended to the case where the programs or theories concerned are formulated in different languages. We suggest that theories in different languages be considered equivalent in the strong sense or synonymous if and only if each is bijectively interpretable (hence transla...

متن کامل

Answer Sets for Propositional Theories

Equilibrium logic, introduced by David Pearce, extends the concept of an answer set from logic programs to arbitrary sets of formulas. Logic programs correspond to the special case in which every formula is a “rule” — an implication that has no implications in the antecedent (body) and consequent (head). The semantics of equilibrium logic looks very different from the usual definitions of an an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Artif. Intell.

دوره 234  شماره 

صفحات  -

تاریخ انتشار 2016